264 research outputs found

    Qualitative Topological Coverage of Unknown Environments by Mobile Robots

    No full text
    This thesis considers the problem of complete coverage of unknown environments by a mobile robot. The goal of such navigation is for the robot to visit all reachable surfaces in an environment. The task of achieving complete coverage in unknown environments can be broken down into two smaller sub-tasks. The first is the construction of a spatial representation of the environment with information gathered by the robot's sensors. The second is the use of the constructed model to plan complete coverage paths. A topological map is used for planning coverage paths in this thesis. The landmarks in the map are large scale features that occur naturally in the environment. Due to the qualitative nature of topological maps, it is rather difficult to store information about what area the robot has covered. This difficulty in storing coverage information is overcome by embedding a cell decomposition, called slice decomposition, within the map. This is achieved using landmarks in the topological map as cell boundaries in slice decomposition. Slice decomposition is a new cell decomposition method which uses the landmarks in the topological map as its cell boundaries. It decomposes a given environment into non-overlapping cells, where each cell can be covered by a robot following a zigzag pattern. A new coverage path planning algorithm, called topological coverage algorithm, is developed to generate paths from the incomplete topological map/slice decomposition, thus allowing simultaneous exploration and coverage of the environment. The need for different cell decompositions for coverage navigation was first recognised by Choset. Trapezoidal decomposition, commonly used in point-to-point path planning, creates cells that are unnecessarily small and inefficient for coverage. This is because trapezoidal decomposition aims to create only convex cells. Thus, Choset proposed boustrophedon decomposition. It introduced ideas on how to create larger cells that can be covered by a zigzag, which may not necessarily be convex. However, this work is conceptual and lacking in implementation details, especially for online creation in unknown environments. It was later followed by Morse decomposition, which addressed issues on implementation such as planning with partial representation and cell boundary detection with range sensors. The work in this thesis was developed concurrently with Morse decomposition. Similar to Morse decomposition, slice decomposition also uses the concepts introduced by boustrophedon decomposition. The main difference between Morse decomposition and slice decomposition is in the choice of cell boundaries. Morse decomposition uses surface gradients. As obstacles parallel to the sweep line are non-differentiable, rectilinear environments cannot be handled by Morse decomposition. Also, wall following on all side boundaries of a cell is needed to discover connected adjacent cells. Therefore, a rectangular coverage pattern is used instead of a zigzag. In comparison, slice decomposition uses topology changes and range sensor thresholding as cell boundaries. Due to the use of simpler landmarks, slice decomposition can handle a larger variety of environments, including ones with polygonal, elliptical and rectilinear obstacles. Also, cell boundaries can be detected from all sides of a robot, allowing a zigzag pattern to be used. As a result, the coverage path generated is shorter. This is because a zigzag does not have any retracing, unlike the rectangular pattern. The topological coverage algorithm was implemented and tested in both simulation and with a real robot. Simulation tests proved the correctness of the algorithm; while real robot tests demonstrated its feasibility under inexact conditions with noisy sensors and actuators. To evaluate experimental results quantitatively, two performance metrics were developed. While there are metrics that measure the performance of coverage experiments in simulation, there are no satisfactory ones for real robot tests. This thesis introduced techniques to measure effectiveness and efficiency of real robot coverage experiments using computer vision techniques. The two metrics were then applied to results from both simulated and real robot experiments. In simulation tests, 100% coverage was achieved for all experiments, with an average path length of 1.08. In real robot tests, the average coverage and path length attained were 91.2% and 1.22 respectively

    On a Service-Oriented Approach for an Engineering Knowledge Desktop

    No full text
    Increasingly, manufacturing companies are shifting their focus from selling products to providing services. As a result, when designing new products, engineers must increasingly consider the life cycle costs in addition to any design requirements. To identify possible areas of concern, designers are required to consult existing maintenance information from identical products. However, in a large engineering company, the amount of information available is significant and in wide range of formats. This paper presents a prototype knowledge desktop suitable for the design engineer. The Engineering Knowledge Desktop analyses and suggests relevant information from ontologically marked-up heterogeneous web resources. It is designed using a Service-Oriented Architecture, with an ontology to mediate between Web Services. It has been delivered to the user community for evaluation

    Grimoires: Grid Registry with Metadata Oriented Interface: Robustness, Efficiency, Security --- Work-in-Progress

    No full text
    Grid registries allow users to discover resources made available by Grid resource providers. In this paper, we present our on-going work on a next-generation registry, initially designed as part of the myGrid project and to be part of the OMII Grid software release. Specifically, we discuss the support of semantic service descriptions and task/user-specific metadata, along with related performance and security considerations

    Data Mining to Support Engineering Design Decision

    No full text
    The design and maintenance of an aero-engine generates a significant amount of documentation. When designing new engines, engineers must obtain knowledge gained from maintenance of existing engines to identify possible areas of concern. Firstly, this paper investigate the use of advanced business intelligence tenchniques to solve the problem of knowledge transfer from maintenance to design of aeroengines. Based on data availability and quality, various models were deployed. An association model was used to uncover hidden trends among parts involved in maintenance events. Classification techniques comprising of various algorithms was employed to determine severity of events. Causes of high severity events that lead to major financial loss was traced with the help of summarization techniques. Secondly this paper compares and evaluates the business intelligence approach to solve the problem of knowledge transfer with solutions available from the Semantic Web. The results obtained provide a compelling need to have data mining support on RDF/OWL-based warehoused data

    Provenance-based validation of E-science experiments

    No full text
    E-Science experiments typically involve many distributed services maintained by different organisations. After an experiment has been executed, it is useful for a scientist to verify that the execution was performed correctly or is compatible with some existing experimental criteria or standards. Scientists may also want to review and verify experiments performed by their colleagues. There are no existing frameworks for validating such experiments in today's e-Science systems. Users therefore have to rely on error checking performed by the services, or adopt other ad hoc methods. This paper introduces a platform-independent framework for validating workflow executions. The validation relies on reasoning over the documented provenance of experiment results and semantic descriptions of services advertised in a registry. This validation process ensures experiments are performed correctly, and thus results generated are meaningful. The framework is tested in a bioinformatics application that performs protein compressibility analysis

    A middleware for a large array of cameras

    No full text
    Large arrays of cameras are increasingly being employed for producing high quality image sequences needed for motion analysis research. This leads to the logistical problem with coordination and control of a large number of cameras. In this paper, we used a lightweight multi-agent system for coordinating such camera arrays. The agent framework provides more than a remote sensor access API. It allows reconfigurable and transparent access to cameras, as well as software agents capable of intelligent processing. Furthermore, it eases maintenance by encouraging code reuse. Additionally, our agent system includes an automatic discovery mechanism at startup, and multiple language bindings. Performance tests showed the lightweight nature of the framework while validating its correctness and scalability. Two different camera agents were implemented to provide access to a large array of distributed cameras. Correct operation of these camera agents was confirmed via several image processing agents

    A Comparison of Perceptions of Knowledge and Skills Held by Primary and Secondary Teachers: From the Entry to Exit of Their Preservice Programme

    Get PDF
    The purpose of this study was to investigate if there were differences in the levels of pedagogical knowledge and skills as perceived by the student teachers who were enrolled in the Primary and the Secondary Post Graduate Diploma in Education programme at the National Institute of Education in Singapore. 170 Primary and 426 Secondary student teachers participated in the study. The results showed that there were no significant differences at the beginning of the programme between the two cohorts. However, there were significant differences between the two groups at the end of programme, with the Primary student teachers tending to perceive themselves as gaining more pedagogical knowledge and skills by the end of their initial teacher preparation programme than the Secondary student teachers

    Arginine:glycine amidinotransferase (AGAT) deficiency: Clinical features and long term outcomes in 16 patients diagnosed worldwide

    Get PDF
    Abstract Background Arginine:glycine aminotransferase (AGAT) (GATM) deficiency is an autosomal recessive inborn error of creative synthesis. Objective We performed an international survey among physicians known to treat patients with AGAT deficiency, to assess clinical characteristics and long-term outcomes of this ultra-rare condition. Results 16 patients from 8 families of 8 different ethnic backgrounds were included. 1 patient was asymptomatic when diagnosed at age 3 weeks. 15 patients diagnosed between 16 months and 25 years of life had intellectual disability/developmental delay (IDD). 8 patients also had myopathy/proximal muscle weakness. Common biochemical denominators were low/undetectable guanidinoacetate (GAA) concentrations in urine and plasma, and low/undetectable cerebral creatine levels. 3 families had protein truncation/null mutations. The rest had missense and splice mutations. Treatment with creatine monohydrate (100–800 mg/kg/day) resulted in almost complete restoration of brain creatine levels and significant improvement of myopathy. The 2 patients treated since age 4 and 16 months had normal cognitive and behavioral development at age 10 and 11 years. Late treated patients had limited improvement of cognitive functions. Conclusion AGAT deficiency is a treatable intellectual disability. Early diagnosis may prevent IDD and myopathy. Patients with unexplained IDD with and without myopathy should be assessed for AGAT deficiency by determination of urine/plasma GAA and cerebral creatine levels (via brain MRS), and by GATM gene sequencing

    Bezielle Selectively Targets Mitochondria of Cancer Cells to Inhibit Glycolysis and OXPHOS

    Get PDF
    Bezielle (BZL101) is a candidate oral drug that has shown promising efficacy and excellent safety in the early phase clinical trials for advanced breast cancer. Bezielle is an aqueous extract from the herb Scutellaria barbata. We have reported previously that Bezielle was selectively cytotoxic to cancer cells while sparing non-transformed cells. In tumor, but not in non-transformed cells, Bezielle induced generation of ROS and severe DNA damage followed by hyperactivation of PARP, depletion of the cellular ATP and NAD, and inhibition of glycolysis. We show here that tumor cells' mitochondria are the primary source of reactive oxygen species induced by Bezielle. Treatment with Bezielle induces progressively higher levels of mitochondrial superoxide as well as peroxide-type ROS. Inhibition of mitochondrial respiration prevents generation of both types of ROS and protects cells from Bezielle-induced death. In addition to glycolysis, Bezielle inhibits oxidative phosphorylation in tumor cells and depletes mitochondrial reserve capacity depriving cells of the ability to produce ATP. Tumor cells lacking functional mitochondria maintain glycolytic activity in presence of Bezielle thus supporting the hypothesis that mitochondria are the primary target of Bezielle. The metabolic effects of Bezielle towards normal cells are not significant, in agreement with the low levels of oxidative damage that Bezielle inflicts on them. Bezielle is therefore a drug that selectively targets cancer cell mitochondria, and is distinguished from other such drugs by its ability to induce not only inhibition of OXPHOS but also of glycolysis. This study provides a better understanding of the mechanism of Bezielle's cytotoxicity, and the basis of its selectivity towards cancer cells

    Genomic, Pathway Network, and Immunologic Features Distinguishing Squamous Carcinomas

    Get PDF
    This integrated, multiplatform PanCancer Atlas study co-mapped and identified distinguishing molecular features of squamous cell carcinomas (SCCs) from five sites associated with smokin
    corecore